Sufficient Conditions for a Real Polynomial to Be a Sum of Squares
نویسنده
چکیده
We provide explicit sufficient conditions for a polynomial f to be a sum of squares (s.o.s.), linear in the coefficients of f . All conditions are simple and provide an explicit description of a convex polyhedral subcone of the cone of s.o.s. polynomials of degree at most 2d. We also provide a simple condition to ensure that f is s.o.s., possibly after adding a constant.
منابع مشابه
Sums of Squares on Reducible Real Curves
We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible curves, we show how the answer depends on the configuration of the irreducible components and give complete necessary and sufficient conditions. We also prov...
متن کاملLower Bounds for a Polynomial in Terms of Its Coefficients
We determine new sufficient conditions in terms of the coefficients for a polynomial f ∈ R[X] of degree 2d (d ≥ 1) in n ≥ 1 variables to be a sum of squares of polynomials, thereby strengthening results of Fidalgo and Kovacec [2] and of Lasserre [6]. Exploiting these results, we determine, for any polynomial f ∈ R[X] of degree 2d whose highest degree term is an interior point in the cone of sum...
متن کاملSufficient Conditions for a New Class of Polynomial Analytic Functions of Reciprocal Order alpha
In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.
متن کاملConditions for a Real Polynomial to Be Sum of Squares
We provide explicit conditions for a polynomial f of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of f , i.e. with no lifting. All conditions are simple and provide an explicit description of a convex polyhedral subcone of the cone of s.o.s. polynomials of degree at most 2d. We also provide a simple condition to ensure that f is s.o.s., possibly modulo a c...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007